Inversion of polynomial matrices via state-space
نویسندگان
چکیده
منابع مشابه
Inversion of polynomial matrices via state-space
In this paper, the problem of computing inverses of polynomial matrices has been revisited and algorithms of easy implementation are proposed to deal with either column or non-column reduced matrices. Other contributions of the paper are algorithms to perform column reduction and determinant of polynomial matrices. © 2002 Elsevier Science Inc. All rights reserved.
متن کاملInversion of Mosaic Hankel Matrices via Matrix Polynomial Systems
Heinig and Tewodros [18] give a set of components whose existence provides a necessary and sufficient condition for a mosaic Hankel matrix to be nonsingular. When this is the case they also give a formula for the inverse in terms of these components. By converting these components into a matrix polynomial form we show that the invertibility conditions can be described in terms of matrix rationa...
متن کاملParallel Inversion of Polynomial Matrices
This paper presents an overview of diierent methods proposed in the last several decades for computing the inverse of a polynomial matrix, concentrating on Buss lowicz's algorithm. A detailed description of Buss lowicz's algorithm and its sequential implementation is followed by the presentation of a new parallel algorithm, based on Buss lowicz's. The distributed and shared memory versions of t...
متن کاملLarge Matrix Inversion using State Space Techniques
A new computational technique is presented by which large structured matrices can be inverted. The specified matrix is viewed as the input-output operator of a time-varying system. Recently developed state space algorithms which apply to such systems are then used to compute a QR factorization first and subsequently the inverse of the matrix, starting from a state realization of the matrix. The...
متن کاملStudy of multihomogeneous polynomial systems via resultant matrices
Resultants provide conditions for the solvability of polynomial equations and allow reducing polynomial system solving to linear algebra computations. Sparse resultants depend on the Newton polytopes of the input equations. This polytope is the convex hull of the exponent vectors corresponding to the nonzero monomials of the equations (viewed as lattice points in the Cartesian space of dimensio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2002
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(02)00418-4